#include<bits/stdc++.h>
#define debug puts("CX AK IOI")
using namespace std;
int n,a[100055];
priority_queue<int,vector<int>,greater<int> > q;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){
        if(q.size()&&a[i]>q.top()){
            q.pop();   
        }
        q.push(a[i]);
    }
    printf("%d\n",int(q.size()));
    return 0;
}